System and method for efficient travel time and route computation

ABSTRACT

A system and method efficiently computes travel times between an origin and destination, minimizing expensive calls to a third party service by first geographically expanding both origin and destination and then searching a cache of previously computed or obtained travel times for any route satisfying the expanded origin and destination. A further embodiment concerns a system and method to prepare an optimized routing sequence to travel to a set of geographical task sites, in satisfaction of applicable conditions for one or more of the task sites. Advantageously, optimized routing may employ the disclosed method of computing travel times between origin and destination.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No.14/489,563, entitled “SYSTEM AND METHOD FOR EFFICIENT TRAVEL TIME ANDROUTE COMPUTATION,” filed on Sep. 18, 2014, which is herein incorporatedby reference in its entirety.

TECHNICAL FIELD

The present disclosure is generally related to multi-stop travel routingand in particular to a computer-implemented method, system, andapparatus to optimize travel routing among multiple stops insatisfaction of applicable conditions.

BACKGROUND

Many business today perform on-site deliveries and conduct on-siteservices. In addition to corporate parcel delivery companies and theUnited States Postal Service, many companies perform on-site servicecalls such as product installation, delivery, and repair. For theseentities, the efficient planning of travel times is essential.

SUMMARY

Broadly, the present disclosure concerns an efficient system and methodto compute travel times between an origin and destination, minimizingexpensive calls to a third party service by first geographicallyexpanding both origin and destination and then searching a cache ofpreviously computed or obtained travel times for any travel path betweenthe expanded origin and destination. A further embodiment concerns asystem and method to prepare an optimized routing sequence to travel toa set of geographical task sites, in satisfaction of applicableconditions for one or more of the task sites. Advantageously, optimizedrouting may employ the disclosed method of computing travel timesbetween origin and destination.

The present disclosure may be implemented in the form of acomputer-implemented method or one or more systems, apparatuses,circuits, programmed product, or other forms.

BRIEF DESCRIPTION OF THE DRAWINGS

The description herein makes reference to the accompanying drawingswherein like reference numerals refer to like parts throughout theseveral views.

FIG. 1 is a block diagram showing an exemplary computing environment.

FIG. 2 is a block diagram of an exemplary cloud computing system.

FIG. 3 is a block diagram of an example internal configuration of adigital data processing machine.

FIG. 4 is a perspective view of an exemplary digital data storage.

FIG. 5 is a perspective view of an exemplary logic circuit.

FIG. 6 is a flow chart of exemplary operations to compute travel timebetween coordinates.

FIG. 7 is a flow chart of exemplary operations to prepare an optimizedrouting sequence for a set of tasks.

FIG. 8 is a block diagram illustrating an exemplary operationalinterrelationship between tasks, task sites, home and third partyprocessing systems, and a client.

DETAILED DESCRIPTION

The nature, objectives, and advantages of the invention will become moreapparent to those skilled in the art after considering the followingdetailed description in connection with the accompanying drawings.

1. Hardware Components and Interconnections

A. Overall System Architecture

One aspect of the present disclosure concerns a digital data processingsystem configured to perform various tasks in conjunction with computingtravel time between various sites. The hardware components andinterconnections are described as follows, whereas the functionality ofthe system is separately discussed further below.

As shown in FIG. 1, the overall system 100 includes a processing system102, another processing system 140, and multiple clients 120-122. Thesecomponents are interconnected by one or more networks 130, with oneexample being the public Internet. Other examples of the network 130include a local area network, wide area network, Intranet, Extranet,Internetwork, Wi-Fi network, or any other suitable technology usingwires, radiofrequency, microwave, satellite, cellular, optical, or othertelecommunications. For mere convenience and without any intendedlimitation, the system 102 is referred to as the “home” processingsystem because many of the operations discussed herein occur in thesystem 102. In one example, the home system 102 comprises a server farmwith suitable computational power and communications to support thefunctionality described herein.

For convenience and without any intended limitation, the processingsystem 140 is referred to as a “third party” processing system toemphasize the exemplary configuration where the system 140 is physicallyand geographically distinct from the system 102 and indeed operated by adifferent entity than the system 102. In one example, the system 140 mayalso comprise a server farm of suitable computational power andcommunications to support the functionality described herein. In oneexample, the third party system 140 may comprise computing equipmentrunning a service such as GOOGLE™ maps, MapQuest™, BING™ maps, YAHOO!™maps, and such.

The clients 120-122 comprise client computing machines such as laptopcomputers, desktop machines, workstations, personal data assistants,smart phones, or any other conceivable user computing device capable ofperforming the functionality described herein.

In one exemplary configuration described in greater detail below, thehome system 102 is a client to the third party system 140, in that thehome system 102 obtains certain data services from the third partysystem 140. Although the clients 120-122 may incidentally receiveservices from the third party processing system 140 unrelated to thedetails of this disclosure, the exemplary configuration described belowfocuses on the clients 120-122 receiving data and computational servicesrendered by the home processing system 102.

B. Cloud Computing Generally

In one example, the illustrated system may employ one or more componentsthat employ cloud computing. For example, the home processing system 102may provide cloud computing services to its clients 120-122, andlikewise the third party processing system 140 may provide cloudcomputing services to the home processing system 102. In this sense, thehome processing system 102 concurrently acts as a cloud computingprovider (in relation to the clients 120-122) and a cloud computingclient (in relation to the system 140).

Cloud computing may provide various advantages over traditionalcomputing models, including the ability to allocate shared resourcesamongst many different customers. Under traditional computing models,computing resources are typically allocated to a single customer orentity and substantial portions of those resources may remain unused orunderused.

Computing resources of cloud computing infrastructure may be allocated,for example, using a multi-tenant or a single-tenant architecture. Undera multi-tenant architecture, installations or instantiations ofapplication, database, and/or other software application servers may beshared among multiple customers. For example, a single web server (suchas a unitary Apache installation), application server (such as a unitaryJava Virtual Machine) and/or a single database server catalog (such as aunitary My SQL catalog) may handle requests from multiple customers. Ina multi-tenant architecture, data or applications used by variouscustomers may be commingled or shared. In an implementation of thisarchitecture, the application and/or database server software maydistinguish between and segregate data and other information of thevarious customers using the system. For example, database recordsbelonging to a particular customer may be identified using a customer_idfield in a database table holding records for numerous customers.

Under a single-tenant infrastructure, separate web servers, applicationservers, and/or database servers are created for each customer. In otherwords, each customer will access its dedicated web server(s), will haveits transactions processed using its dedicated application server(s),and will have its data stored in its dedicated database server(s) and orcatalog(s). In a single-tenant architecture, physical hardware serversmay be shared such that multiple installations or instantiations of web,application, and/or database servers may be installed on the samephysical server. Each installation may be allocated a certain portion ofthe physical server resources, such as RAM, storage, and CPU cycles.

In an exemplary implementation, a customer instance is composed of fourweb server instances, four application server instances, and twodatabase server instances. As previously described, each of these serverinstances may be located on different physical servers and each of theseserver instances may share resources of the different physical serverswith a number of other server instances associated with other customerinstances. The web, application, and database servers of the customerinstance may be allocated to two different datacenters to facilitatehigh availability of the applications and data provided by the servers.There may be a primary pair of web servers and application servers in afirst datacenter and a backup pair of web servers and applicationservers in a second datacenter. There may be a primary database serverin the first datacenter and a second database server in the seconddatacenter. The primary database server may replicate data to thesecondary database server. The cloud computing infrastructure may beconfigured to direct traffic to the primary pair of web servers whichmay be configured to utilize the primary pair of application servers andprimary database server respectively. In a failure scenario, thesecondary servers may be converted to primary servers.

The application servers may include a platform application, such as onewritten in Java, for example, that provides generic platformfunctionality for accessing the database servers, integrating withexternal applications, and rendering web pages and other content to betransmitted to clients. The generic platform functionality may beconfigured with metadata stored in the database server. In other words,the operation of the platform on the application server may becustomized by certain end-users of the platform without requiring theJava code of the platform application to be changed. The database serverinstances may be configured with a database configuration and schema tofacilitate the operation of the platform. For example, the databaseserver instance may be configured with various tables for storingmetadata about applications, tables/fields, menus, forms, businessrules, scripts, and custom UI elements that are used to customize theappearance and operation of the customer instance. In someimplementations, the application servers may include web serverfunctionality and the web servers may be omitted.

In an alternative implementation, a customer instance may include onlytwo application servers and one database server. In a given cloudinfrastructure system, different implementations of customer instancesmay be used for different customer instances at the same time. Otherconfigurations and implementations of customer instances may also beused.

C. Cloud Computing System Example

FIG. 2 depicts an exemplary cloud computing system. The exemplary cloudcomputing system includes two customers 200 and 201. Each customer mayhave clients, such as clients 210, 211 for customer 200 and clients 220,221 for customer 201. Each of the clients 210, 211, 220, 221 may be inthe form of a computing system including multiple computing devices, orin the form of a single computing device, for example, a mobile phone, atablet computer, a laptop computer, a notebook computer, a desktopcomputer, and the like. The customers and clients shown are exemplary,and a cloud computing system may have a different number of customers orclients or may have a different configuration of customers or clients.For example, there may be hundreds or thousands of customers and eachcustomer may have any number of clients.

The exemplary cloud computing system includes two datacenters 240 and241. Each datacenter includes servers, such as servers 250, 251 fordatacenter 240 and servers 260, 261 for datacenter 241. Each datacentermay represent a different location where servers are located, such as adatacenter facility in San Jose, Calif. or Amsterdam, Netherlands. Eachof the servers 250, 251, 260, 261 may be in the form of a computingsystem including multiple computing devices, or in the form of a singlecomputing device, for example, a desktop computer, a server computer andthe like. The datacenters and servers shown are exemplary, and a cloudcomputing system may have a different number of datacenters and serversor may have a different configuration of datacenters and servers. Forexample, there may be tens of data centers and each data center may havehundreds or any number of servers.

The exemplary clients 210, 211, 220, 221 and servers 250, 251, 260, 261are connected to a network 230. The clients for a particular customermay connect to the network 230 via a common connection point ordifferent connection points. The network 230 can, for example, be theInternet. The network 230 may also be or include a local area network,wide area network, virtual private network, or any other means oftransferring data between any of the clients 210, 211, 220, 221 andservers 250, 251, 260, 261. The network 230, datacenters 240, 241,and/or blocks not shown may include network hardware such as routers,switches, load balancers, and/or other network devices. For example,each of the datacenters 240, 241 may have one or more load balancers forrouting traffic from the network 230 to various servers such as theservers 250, 251, 260, 261.

Other implementations of the exemplary cloud computing system are alsopossible. For example, devices other than the clients and servers shownmay be included in the system. In an implementation, one or moreadditional servers may operate as a cloud infrastructure control, fromwhich servers and/or clients of the cloud infrastructure are monitored,controlled, and/or configured. For example, some or all of thetechniques described herein may operate on said cloud infrastructurecontrol servers. Alternatively or in addition, some or all of thetechniques described herein may operate on servers such as servers 250,251, 260, 261.

D. Implementation of Data Processing Entities

There are various data processing components in the illustrated systems,such as the system 102, system 140, clients 120-122, customers 200-201,data centers 240-241, servers 250-251, servers 260-261, and the like.Furthermore, other components of the disclosed systems may include smartfeatures, and in this respect, these components may include dataprocessing features. In any of these cases, such data processingfeatures may be implemented by one or more instances of hardware,software, firmware, or a subcomponent or combination of the foregoing.The makeup of these subcomponents is described in greater detail below,with reference to FIGS. 3-5.

E. Exemplary Digital Data Processing Apparatus

As mentioned above, the various data processing entities of FIGS. 1-2may be implemented in different ways. FIG. 3 shows one example, in theform of a digital data processing apparatus 300. More particularly, FIG.3 illustrates a block diagram of an exemplary internal configuration ofa digital data processing machine 300. The machine 300 may beimplemented by one or more computing devices such as a mobile phone, atablet computer, laptop computer, notebook computer, desktop computer,server computer, mainframe computer, computer workstation, and the like.

The exemplary machine 300 includes a CPU 302, RAM 304, storage 312,network 306, display 308, and bus 310. One example of the CPU 302 is aconventional central processing unit. The CPU 302 may include single ormultiple processors each having single or multiple processing cores.Alternatively, CPU 302 may include another type of device, or multipledevices, capable of manipulating or processing information now-existingor hereafter developed.

The RAM 304 may be Random Access Memory or any other suitable type ofstorage device. The RAM 304 may include executable instructions and datafor immediate access by CPU 302. The RAM 304 may include one or moreDRAM modules such as DDR SDRAM. Alternatively, the RAM 304 may includeanother type of device, or multiple devices, capable of storing data forprocessing by CPU 302 now-existing or hereafter developed. The CPU 302may access and manipulate data in RAM 304 via bus 310.

The storage 312 may include executable instructions 312 a andapplication files 312 b along with other data. The executableinstructions 312 a may include, for example, an operating system and oneor more application programs for loading in whole or part into the RAM304 to be executed by the CPU 302. The operating system may be, forexample, Windows, Mac OS X, Linux, or another operating system suitableto the details of this disclosure. The application program may include,for example, a web browser, web server, and/or database server. Theapplication files 312 b can, for example, include user files, databasecatalogs, and configuration information. Storage 312 may comprise one ormultiple devices and may utilize one or more types of storage, such assolid state or magnetic.

The internal configuration may also include one or more input/outputdevices, such as the network 306 and the display 308. The network 306and display 308 may be coupled to the CPU 302 via the bus 310, in oneexample. The network 306 may, for example, provide a network interfaceand may take the form of a wired network interface such as Ethernet or awireless network interface. Other output devices that permit a user toprogram or otherwise use the client or server may be provided inaddition to or as an alternative to the display 308. When the outputdevice is or includes a display, the display may be implemented invarious ways, including by a LCD, CRT, LED, OLED, etc.

Other implementations of the internal architecture of clients andservers are also possible. For example, servers may omit the display 308as well as client programs such as web browsers. Operations of the CPU302 may be distributed across multiple machines which may be coupleddirectly or across a local area or other network. The RAM 304 or storage312 may be distributed across multiple machines such as network-basedmemory or memory in multiple machines performing the operations ofclients or servers. Although depicted here as a single bus, the bus 208may be composed of multiple buses.

F. Storage Media

As mentioned above, various instances of digital data storage may beused, for example, to provide storage used by the systems of FIG. 1and/or FIG. 2, to embody the storage 312 or RAM 304, etc. Depending uponits application, this digital data storage may be used for variousfunctions, such as storing data and/or storing machine-readableinstructions. These instructions may themselves aid in carrying outvarious processing functions, or they may serve to install a softwareprogram upon a computer, where such software program is thereafterexecutable to perform other functions related to this disclosure.

In any case, the storage media may be implemented by nearly anymechanism to digitally store machine-readable signals. One example isoptical storage such as CD-ROM, WORM, DVD, digital optical tape, diskstorage 400 (FIG. 4), or other optical storage. Another example isdirect access storage, such as a conventional “hard drive”, redundantarray of inexpensive disks (RAID), or another direct access storagedevice (DASD). Another example is serial-access storage such as magneticor optical tape. Still other examples of digital data storage includeelectronic memory such as ROM, EPROM, flash PROM, EEPROM, memoryregisters, battery backed-up RAM, etc.

An exemplary storage medium is coupled to a processor so the processormay read information from, and write information to, the storage medium.In the alternative, the storage medium may be integral to the processor.In another example, the processor and the storage medium may reside inan ASIC or other integrated circuit.

G. Logic Circuitry

In contrast to storage media that contain machine-executableinstructions, as described above, a different embodiment uses logiccircuitry to implement some or all of the processing features describedherein. Depending upon the particular requirements of the application inthe areas of speed, expense, tooling costs, and the like, this logic maybe implemented by constructing an application-specific integratedcircuit (ASIC) having thousands of tiny integrated transistors. Such anASIC may be implemented with CMOS, TTL, VLSI, or another suitableconstruction. Other alternatives include a digital signal processingchip (DSP), discrete circuitry (such as resistors, capacitors, diodes,inductors, transistors, and the like), field programmable gate array(FPGA), programmable logic array (PLA), programmable logic device (PLD),and the like. FIG. 5 shows an example of logic circuitry in the form ofan integrated circuit 500.

2. Operation

Having described the structural features of the present disclosure, theoperational aspect of the disclosure will now be described. The steps ofany method, process, or algorithm described in connection with theembodiments disclosed herein may be embodied directly in hardware,firmware, software executed by hardware, circuitry, or a combination ofthese.

A. Routing between Coordinates

FIG. 6 shows a sequence 600 to illustrate one implementation of themethod aspect of this disclosure. Broadly, this sequence serves tocompute travel time between geographical sites. For ease of explanation,but without any intended limitation, the example of FIG. 6 is describedin the specific context of FIG. 8, which depicts the relationshipbetween the home processing system 802, third party processing system808, client 812, tasks 804, and task sites 814 in one implementation.Also shown in FIG. 8, the home processing system 802 contains a cache802 a. The cache 802 a comprises any suitable manner of volatile ornonvolatile digital data storage, and as discussed in greater detailbelow, the cache 802 a functions to store travel times that have beenobtained from the system 808 along with the corresponding origin anddestination coordinates. Systems 802, 808 and client 812 can each beimplemented as a computing device such as digital data processingapparatus 300.

In step 602, the system 802 receives (via 813) a request to computetravel time between origin and destination coordinates, which may alsobe called locations. In this example, the coordinates are geographiclocations, described by latitude and longitude, although any othersuitable system for describing geographical locations may be used suchas UTM, UPS, and the like. The request may originate from the client 812or virtually any other source, but in the presently describedembodiment, the request comes from an optimization routine (describedbelow) which runs on the home processing system 802 as discussed ingreater detail below.

In step 604, the system 802 searches the cache 802 a for the origin anddestination coordinates to see if the cache contains a previouslycomputed or obtained travel time for these coordinates. According to anoptional enhancement, prior to executing the search 604, the originand/or destination coordinates may be reduced in precision in order tobroaden the search. For example, the origin and/or destinationcoordinates may be rounded to a given number of decimal places. As amore specific example, latitude and longitude coordinates may be reducedto three decimal places. This reduction in precision recognizes thattravel times might not be appreciably different if computed based on anapartment in the same building as the origin/destination coordinate, ora home across the street, or a building one block away.

If records in the cache 802 a are order-specific as to origin anddestination, then step 604 also conducts a second search, reversing theorder of the origin coordinate and the destination coordinate.

If the search from 604 yielded a stored travel time, the system 802outputs the found travel time in step 605. The output may occur in theform of displaying the output on the display 308 or other machine-drivenscreen such as a computer monitor, sending the output inmachine-readable form to a process that called the sequence 600,transmitting a machine-readable signal representing the output to theclient 120-122 or 812 or other requestor, or providing another suitableoutput form.

However, if the search 604 failed to find a relevant stored travel time,then the system 802 checks whether a so-called “rough estimate”(described below) is acceptable. Acceptability may be determined bypresence or absence of any condition or state, without limitation.However, in the context of the presently described example, the issue ofwhether a rough estimate is acceptable is specified by the callingprocess that invokes the sequence 600. This is described further below,in conjunction with the sequence 700 of FIG. 7.

The use of “route estimates” in step 606, and also the use of the cache802 a in step 604, can save on cost and improve performance by helpingto reduce requests to the third party processing system 808. In somescenarios, such requests constitute API calls, and API calls to thesystem 808 can trigger financial charges to the requestor under somecircumstances. Performance can be improved by eliminating the delayintrinsic in the performance of such requests.

If step 606 answers YES, then step 608 computes a straight line distancebetween the origin and destination coordinates. This distance may becomputed, for example, by applying a mathematical formula to thelatitudes and longitudes. Then, also in step 608, the system 802computes the travel time between origin and destination coordinatesusing a predetermined “regional average speed.” The regional averagespeed is a straight line speed calculated by computing a running averageof straight line speeds calculated from the travel times that the system802 obtains from the third party processing system 808, and the straightline distances calculated by the system 802 over time. In one example,in order to increase the relevance of the regional average speed, theremay be multiple different regional average speeds, regionalizedaccording to city, neighborhood, metro area, highway, or othergeographical area or division. Step 608 employs the regional averagespeed of the sector most appropriate to the origin and/or destinationcoordinates. Furthermore, regional average speeds may be limited to dataof a prescribed recency.

Also in step 608, the system 802 provides an output of the computedtravel time. The output of step 608 may be supplied in the same manneras the output of step 605, described above.

In contrast to the foregoing description, step 608 is not performed ifstep 606 finds that a “rough estimate” is not acceptable. In this case,step 606 answers NO and proceeds to step 610. Here, the system 802 askswhether the third party processing system 808 is available. In thepresent example, which concerns computing travel times betweengeographic coordinates, the system 808 may comprise a service such asGOOGLE™ maps, MapQuest™, BING™ maps, YAHOO!™ maps, and such.“Availability” of the third party service may be determined according tovarious criteria, such as whether the third party service is on-line,whether the system 802 presently has Internet connectivity, whether thesystem 802 or client 812 has remaining credits or funds at the thirdparty service, whether a given subscription to services of the system808 is intact, whether the system 802 or client 812 has reached aself-imposed monthly or other period limit for invoking third partyservices, or other examples. For example, access to the third partyservice may be facilitated by an application programming interfaceprovided by the third party. Access to the third party service can be,for example, controlled using a unique key assigned to a particularentity. For example, system 802 can provide the ability for a user ofthe system to enter a unique key or use a default unique key provided bysystem 802. Costs associated with using the third party system can beassessed by the third party to the entity associated with the unique keyused to access the third party system.

If step 610 deems the third party service available, step 610 answersYES, and the system 802 in step 612 sends (via 810) the third partysystem 808 a request to compute a travel time for the origin anddestination coordinates. After the system 802 receives a result from thethird party service 808, the system 802 then provides an output of theresult. The output may be provided in the same manner as steps 605 and608, described above. Step 612 also stores the travel times andassociated coordinates in the cache 802 a. After step 612, the system802 proceeds to step 616, where it employs the travel time and distancefrom the third party system 808 to update and store the regional averagespeed.

In contrast to the foregoing description, steps 612 and 616 are notperformed if step 610 found the third party service 808 to beunavailable. In this case, step 610 answers NO and the system 802performs step 614. Here, the system manually computes the distancebetween origin and destination coordinates instead of using the thirdparty service. This distance may be computed, for example, by applying amathematical formula to the latitudes and longitudes to compute a“straight line” distance. Then, also in step 614, the system 802computes the travel time between origin and destination coordinatesusing an “estimated average speed.” The estimated average speed is apredetermined speed, such as 20 mph, which the system 802 adjustsaccording to trip distance. For example, the system (still in step 614)may increase the estimated average speed by fifty percent for tripslonger than twenty miles, and decrease the estimated average speed byfifty percent for trips shorter than twenty miles. Thus, for a trip ofthirty miles, the system would use an estimated average speed of 30 mph.Of course, other baseline speeds and adjustment factors may be used orand even refined over time, as appropriate.

With the adjusted estimated average speed in hand, the system 802 (stillin step 614) uses this speed along with the computed distance to computea travel time between origin and destination coordinates. Then, thesystem 802 completes step 614 by providing an output of the computedtravel time. This output may be rendered in the same manner, forexample, as the outputs provided in steps 605, 608, and/or 612.

Upon completing steps 608, 616, or 614, the sequence 600 is finished,and the system 802 awaits another request, which will start the processagain in step 602.

B. Optimizing Routing

FIG. 7 shows a sequence 700 to illustrate a different implementation ofthe method aspect of this disclosure. Broadly, this sequence serves tocompute an optimized route between various geographic task sites. Forease of explanation, but without any intended limitation, the example ofFIG. 7 is described in the specific context of FIG. 8, whichfunctionally depicts the relationship between the home processing system802, third party processing system 808, client 812, tasks 804, and tasksites 814.

The steps 700 are initiated in step 702, when the home processing system802 receives, computes, generates, assembles, or otherwise obtains a setof tasks 804. In one example, an exemplary client 812 machine oroperator automatically or manually submits the tasks 804 to the system802. Alternatively, the system 802 may generate the tasks based on datadescribing the client 812′s operations, based on an accumulation ofservice calls received or generated at the system 802, or based on otherdata or metadata retrieved from (or submitted by) one or more clientssuch as 812.

Each task describes an operation to be completed, and is associated witha task site. The task sites are geographical locations where the tasksare to be performed. In the present example, task sites are described interms of latitude and longitude, although any suitable coordinate systemmay be used in practice. Each task may also be associated with one ormore conditions applicable to that task. Some examples of applicableconditions include a window of time within which a task must becompleted, and an order of completing one task relative to another task.

In one example, the sequence 700 is performed by a business providinginformation technology products and services. In this context, someexemplary tasks might include delivering a component such as a laptopcomputer, picking up a component for repair, repairing a client'scomputer, installing a network, reconfiguring an installation, and thelike.

A starting location 830 is illustrated, which is not one of the tasksites in this example, although it could be a task site in anotherimplementation. The starting location 830 may comprise a home locationof the entity that operates the system 802, a fleet parking area, alocation of last task completed, a home of a service technician thattakes a fleet vehicle home daily, or another appropriate location.

In step 704, the system 802 determines a travel time between thestarting location 830 and each of the task sites 814. This includestravel times between: the starting location 830 and the task site 816,the starting location 830 and the task site 818, the starting location830 and the task site 820, and so on. The depicted task sites areexemplary only and are not to scale. Task sites can include any locationand in an implementation, task sites can for example be constrained to aparticular city, county, state, or other geographical region. Thisinitial operation avoids “rough estimates” in accordance with step 606of FIG. 6. Therefore, the travel times are computed in accordance withsteps 610 and 612 or 614 from FIG. 6.

Step 706 is performed in order to (1) store the travel times of step 704in the cache 802 a, and (2) compute or update a regional average speedbased on these travel times. If the travel times of step 704 were notobtained from the third party service, then step 706 is skipped in oneexemplary implementation. In this case, the regional average speed willbe the stored regional average speed that has been prepared and storedover time because of previous instances of step 704, in accordance withstep 616 (FIG. 6). In one example, the regional average speed for agiven route is based exclusively upon the travel times obtained for thatroute in step 704, to ensure greatest temporal and geographic relevancy.

In step 707, the system 802 designates one of the task sites 814 as a“current” task site. In the present example, the first current task siteis selected to be the task site that is geographically nearest to thefirst starting location. As discussed below, the starting location canchange over various iterations of the sequence 700, so hence thereference to a “first” starting location.

Next, in step 708, the system 802 prepares a single virtual routeproceeding in series from the current task site to each of the remainingtask sites. In this example, the system 802 establishes the virtualroute by sorting any task sites with time window conditions according towindow end time, where tasks with chronologically earlier window timesoccur earlier and tasks with chronologically later window times occurlater. Task sites without any conditions can be placed anywhere in thevirtual route, grouped at the end of the route, or treated in anotherway. In one specific implementation of step 708, the virtual route iscomputed by always placing the tasks without any applicable conditionsat the end of the route. In an alternative, these tasks are omitted fromstep 708, and when the final optimized route (minus the tasks withoutany applicable conditions) is determined, then, these tasks are added byrepeating step 708 as needed. A different option, instead ofre-performing step 708, is to add the remaining no-condition tasks bycomputing every possible route among the no-condition tasks, andselecting the route with the least overall travel time.

Also in step 708, the system 802 calculates travel times between tasksites over the single virtual route being analyzed. In this operation,“rough estimates” are acceptable, so this is carried out with step 608from FIG. 6, using the regional average speed.

Next, in step 710 the system 802 asks whether the current virtual routeresulted in any unschedulable tasks, considering the order and traveltimes of the tasks. For example, an unschedulable task might include atask that could not be conducted in its applicable time window. If step710 answers NO, then step 716 is performed as discussed in greaterdetail below.

If task 710 answer YES, then step 710 proceeds to step 711. Step 711asks whether steps 708 and 710 have been performed using all remainingtask sites of the task set 804 as the “current” task site. If step 711answers NO, then step 711 proceeds to step 712. Here, the system 802designates a different task site as the current task and returns to step708. For example, step 712 may designate the next-nearest task site tothe starting location 830 as the “current” task. During the firstiteration of performing step 712, this is the second-nearest task site,and then if task 710 answers YES and task 711 answers NO, thethird-nearest task, then fourth-nearest, and so on. After step 712, step708 computes a new hypothetical route, using the current task asdesignated in step 712.

Whenever step 711 answers YES, however, then step 711 proceeds to step713. Here, the system 802 identifies the task site that, when selectedas the “current” site, resulted in the hypothetical route with the leastnumber of unschedulable tasks under the computation of step 708.

Next, step 713 advances to step 716, where the current task is added tothe final optimized route. In essence, step 716 fixes the order that thecurrent task will be performed relative to other tasks in the final,optimized route. In other words, the ultimate order of performing tasksin the optimized route is determined by the order of which tasks areadded in step 716.

After step 716, step 717 asks whether there are two or more tasksremaining in the current task set, which has been reduced by any tasksremoved in accordance with step 720, as discussed below. If so, thenstep 717 advances to step 720, which sets the starting location as thecurrent task, and removes the current task from the set of input tasks804. After step 720, the process 700 returns to step 704, whichfunctions as described above, except that the current task from the lastperformance of step 716 is removed from the task set 804 and this taskbecomes the starting location. At this point, the input task set is nowreduced by all tasks having been added in step 716. The next ensuing ofthe sequence 700 will determine the next task to be performed in theoptimized route, and so on.

In contrast to the foregoing description, whenever step 717 finds thatthe task set only contains two tasks, then the calculation ofhypothetical routes is finished. Step 722 then provides a final output.This output may comprise an ordered listing of tasks or task sites. Forinstance, the final route may be embodied by a listing of tasks added instep 716. The order of these tasks is the same chronological order inwhich the individual tasks were added in step 716. As an optionalenhancement, step 722 may send a request to the third party processingsystem 808 to obtain step by step driving instructions, distances,travel times, or other information along the optimized route, andnamely, from the starting location to each of the task sites in theorder calculated by the optimized routing.

The output of step 722 may occur in the form of displaying the output ona machine-driven screen such as a computer monitor, sending the outputto a process that called the sequence 600, transmitting the output tothe client 812 or other requestor, sending an email or graphic or otherreport of the optimized route, displaying the optimized route on a webpage or smart phone application, or providing another suitable outputform. Alternatively, the output of 722 can include an error in the eventthat an optimized route could not be generated for the provided tasks.With the conclusion of step 722, the sequence 800 ends.

3. Other Embodiments

While the foregoing disclosure shows a number of illustrativeembodiments, it will be apparent to those skilled in the art thatvarious changes and modifications can be made herein without departingfrom the scope of the invention as defined by the appended claims.Accordingly, the disclosed embodiment are representative of the subjectmatter which is broadly contemplated by the present invention, and thescope of the present invention fully encompasses other embodiments whichmay become obvious to those skilled in the art, and that the scope ofthe present invention is accordingly to be limited by nothing other thanthe appended claims.

All structural and functional equivalents to the elements of theabove-described embodiments that are known or later come to be known tothose of ordinary skill in the art are expressly incorporated herein byreference and are intended to be encompassed by the present claims.Moreover, it is not necessary for a device or method to address each andevery problem sought to be solved by the present invention, for it to beencompassed by the present claims. Furthermore, no element, component,or method step in the present disclosure is intended to be dedicated tothe public regardless of whether the element, component, or method stepis explicitly recited in the claims. No claim element herein is to beconstrued under the provisions of 35 USC 112, sixth paragraph, unlessthe element is expressly recited using the phrase “means for” or, in thecase of a method claim, the phrase “step for.”

Furthermore, although elements of the invention may be described orclaimed in the singular, reference to an element in the singular is notintended to mean “one and only one” unless explicitly so stated, butshall mean “one or more”. Additionally, ordinarily skilled artisans willrecognize that operational sequences must be set forth in some specificorder for the purpose of explanation and claiming, but the presentinvention contemplates various changes beyond such specific order.

In addition, those of ordinary skill in the relevant art will understandthat information and signals may be represented using a variety ofdifferent technologies and techniques. For example, any data,instructions, commands, information, signals, bits, symbols, and chipsreferenced herein may be represented by voltages, currents,electromagnetic waves, magnetic fields or particles, optical fields orparticles, other items, or a combination of the foregoing.

Moreover, ordinarily skilled artisans will appreciate that anyillustrative logical blocks, modules, circuits, and process stepsdescribed herein may be implemented as electronic hardware, computersoftware, or combinations of both. To clearly illustrate thisinterchangeability of hardware and software, various illustrativecomponents, blocks, modules, circuits, and steps have been describedabove generally in terms of their functionality. Whether suchfunctionality is implemented as hardware or software depends upon theparticular application and design constraints imposed on the overallsystem. Skilled artisans may implement the described functionality invarying ways for each particular application, but such implementationdecisions should not be interpreted as causing a departure from thescope of the present invention.

This specification has been set forth with various headings andsubheadings. These are included to enhance readability and ease theprocess of finding and referencing material in the specification. Theseheading and subheadings are not intended, and should not be used, toaffect the interpretation of the claims or limit claim scope in any way.

What is claimed is:
 1. A system, comprising: a non-transitory memory;and one or more hardware processors configured to read instructions fromthe non-transitory memory to perform operations comprising: determininga starting location, wherein the starting location comprises a locationof a completed task; receiving a request to compute a travel routebetween the starting location and a set of task sites, the set of tasksites comprising a first task site and a second task site; generatingthe travel route based on a minimization of a total travel time ofrespective travel times between the starting location and the first tasksite, between the starting location and the second task site, andbetween the first task site and the second task site; and transmittingthe travel route to a requestor.
 2. The system of claim 1, wherein thecompleted task comprises a delivery of a component, an acquirement ofthe component, an installation of a network, a reconfiguration of thenetwork, or any combination thereof.
 3. The system of claim 1, whereinthe travel route comprises driving instructions between the startinglocation and the set of task sites, distances between the startinglocation and the set of task sites, travel times between the startinglocation and the set of task sites, or any combination thereof.
 4. Thesystem of claim 1, wherein generating the travel route comprises:searching for previously cached travel times between the startinglocation and the set of task sites, wherein the previously cached traveltimes were previously obtained from a request, sent via networkcommunications using an application programming interface, to a thirdparty service to calculate the respective travel times between thestarting location, the first task site, and the second task site; andcalculating respective regional average speeds between the startinglocation, the first task site, and the second task site based on thepreviously cached travel times; and generating the travel route based onthe calculated regional average speeds.
 5. The system of claim 4,wherein generating the travel route comprises: truncating a longitudeand a latitude for respective geographical locations for each of thestarting location and of the set of task sites before searching for thepreviously cached travel times between the starting location and the setof task sites.
 6. The system of claim 1, wherein generating the travelroute comprises: calculating a regional average speed based onpreviously cached travel times and corresponding travel distances;calculating straight line distances between each of the startinglocation and the set of task sites; testing multiple possible routesfrom the starting location and proceeding in series to the first tasksite and the second task site of the set of task sites using theregional average speed and the straight line distances for every segmentof the multiple possible routes; and identifying the travel route as ashortest route of the multiple possible routes.
 7. The method of claim1, wherein generating the travel route comprises: sending a request to athird party processing system to determine the travel route.
 8. Themethod of claim 1, wherein the travel route satisfies conditionsassociated with the set of task sites, wherein the conditions comprise arange of time in which the first task of the set of task sites is to becompleted and an order of completing the first task relative to thesecond task of the set of task sites.
 9. A method to determine a travelroute between a set of task sites, comprising: determining a startinglocation, wherein the starting location comprises a location of acompleted task; receiving a request to compute a travel route betweenthe starting location and a set of task sites, the set of task sitescomprising a first task site and a second task site; generating thetravel route based on a minimization of a total travel time ofrespective travel times between the starting location and the first tasksite, between the starting location and the second task site, andbetween the first task site and the second task site; and transmittingthe travel route to a requestor.
 10. The method of claim 9, wherein thecompleted task comprises a delivery of a component, an acquirement ofthe component, an installation of a network, a reconfiguration of thenetwork, or any combination thereof.
 11. The method of claim 9, whereinthe travel route comprises driving instructions between the startinglocation and the set of task sites, distances between the startinglocation and the set of task sites, travel times between the startinglocation and the set of task sites, or any combination thereof.
 12. Themethod of claim 9, wherein generating the travel route comprises:searching for previously cached travel times between the startinglocation and the set of task sites, wherein the previously cached traveltimes were previously obtained from a request, sent via networkcommunications using an application programming interface, to a thirdparty service to calculate the respective travel times between thestarting location, the first task site, and the second task site; andcalculating respective regional average speeds between the startinglocation, the first task site, and the second task site based on thepreviously cached travel times; and generating the travel route based onthe calculated regional average speeds.
 13. The method of claim 12,wherein generating the travel route comprises: truncating a longitudeand a latitude for respective geographical locations for each of thestarting location and of the set of task sites before searching for thepreviously cached travel times between the starting location and the setof task sites.
 14. The method of claim 9, wherein generating the travelroute comprises: calculating a regional average speed based onpreviously cached travel times and corresponding travel distances;calculating straight line distances between each of the startinglocation and the set of task sites; testing multiple possible routesfrom the starting location and proceeding in series to the first tasksite and the second task site of the set of task sites using theregional average speed and the straight line distances for every segmentof the multiple possible routes; and identifying the travel route as ashortest route of the multiple possible routes.
 15. The method of claim9, wherein generating the travel route comprises: sending a request to athird party processing system to determine the travel route.
 16. Themethod of claim 9, wherein the travel route satisfies conditionsassociated with the set of task sites, wherein the conditions comprise arange of time in which the first task of the set of task sites is to becompleted and an order of completing the first task relative to thesecond task of the set of task sites.
 17. A tangible, non-transitory,machine-readable medium, comprising machine-readable instructions,configured to: compute an optimized routing sequence from a startinglocation to a set of corresponding task sites, wherein the startinglocation comprises a location of a completed task, wherein computing theoptimized routing sequence comprises: searching a cache for travel timesbetween the starting location and the set of corresponding task sites;determining an optimized route based on minimizing a total time of thetravel times between the starting location and the set of correspondingtask sites; and transmitting the optimized route to a requestor.
 18. Thetangible, non-transitory, machine-readable medium of claim 17, whereincomputing the optimized routing sequence comprises: computing expandedgeographical locations of the starting location and the set ofcorresponding task sites prior to searching the cache for the traveltimes.
 19. The tangible, non-transitory, machine-readable medium ofclaim 17, wherein computing the optimized routing sequence comprises:responsive to not finding the travel times within the cache, requestinga third party service to calculate the travel times between the startinglocation and the set of corresponding task sites.
 20. The tangible,non-transitory, machine-readable medium of claim 19, wherein computingthe optimized routing sequence comprises: responsive to unavailabilityof the third party service, computing distances between the startinglocation and the set of corresponding task sites, retrieving apredefined estimated average speed, using a prescribed formula to adjustthe predefined estimated average speed according to the computeddistances, and computing the travel times for the computed distancesusing the adjusted predefined estimated average speed.